An efficient mapping of Boltzmann Machine computations onto distributed-memory multiprocessors

نویسندگان

  • D. H. Oh
  • Jong H. Nang
چکیده

Oh, D.H., J.H. Nang, H. Yoon and S.R. Maeng, An efficient mapping of Boltzmann Machine computations onto distributedmemory multiprocessors, Microprocessing and Microprogramming 33 (1991/92) 223-236. In this paper, an efficient mapping scheme of Boltzmann Machine computations onto a distributed-memory multiprocessor, which exploits the synchronous spatial parallelism, is presented. In this scheme, the neurons in the Boltzmann Machine are partitioned into p disjoint sets, and each set is mapped on a processor of a p-processor system. A parallel convergence and learning algorithms of Boltzmann Machine, necessary communication pattern among the processors, and their time complexities when neurons are partitioned and mapped onto a distributed-memory multiprocessor are investigated. An expected p-processor speedup of the parallelizing scheme over a single processor is also analyzed theoretically. It can be used as a basis in determining the most cost-effective or optimal number of processors with respect to the communication capabilities and interconnection topologies of given distributed-memory multiprocessor.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mapping nested loops onto distributed memory multiprocessors

This paper presents Chain grouping; a new low complexity method for the problem of partitioning the index space into groups with little intercommunication requirements, for mapping onto distributed mesh-connected architectures. First the loop iterations are scheduled in time, according to the hyperplane method, taking into consideration the minimum time displacement. Then, the index space is di...

متن کامل

On Automatic Loop Data-Mapping for Distributed-Memory Multiprocessors

In this paper we present a unified approach for compiling programs for Distributed-Memory Multiprocessors (DMM). Parallelization of sequential programs for DMM is much more difficult to achieve than for shared memory systems due to the exclusive local memory of each Virtual Processor (VP). The approach presented distributes computations among VPs of the system and maps data onto their private m...

متن کامل

A Parallel Boltzmann Machine on Distributed-Memory Multiprocessors

In this paper, an efficient mapping scheme of Boltzmann Machine computations onto a distributed-memory mult@”r, which exploits the synchronous spatral parallelism, is plesentad. In this scheme, the neurons in a BoltPnann Machine are partitioned intop disjoint sets. and each set is mapped on a processor of ap -processor systan. A parallel convergence and leaming algorithms of Balk" Machines, nec...

متن کامل

Mapping Of Backpropagation Learning Onto Distributed Memory Multiprocessors

This paper presents a mapping scheme for p a d e l pipelined execution of the Backpropagation Learning Algorithm o n dtktributed memory multiprocessors (DMMs). The proposed implementation ezhibits training set parallelism that involves batch updating. Simple algorithms have been presented, which allow the data transfer involved in both forward and backward execution3 phases of the backpropagati...

متن کامل

Load Balancing Unstructured Adaptive Grids for CFD Problems

Mesh adapt(on is a powerful tool for efficient unstructured-grid computations but causes load imbalance among processors on a parallel machine. A dynamic load balancing method is presented that balances the workload across all processors with a global view. After each parallel tetrahedral mesh adapt(on, the method first determines if the new mesh is sufficiently unbalanced to warrant a repartit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003